基于光谱分类模型的保险杠物证无损研究

采用中红外光谱结合化学计量学的方法对车用保险杠碎片进行鉴别，分别对52个车用保险杠碎片样本的全波段光谱数据、指纹区光谱数据和主成分分析降维后的光谱数据建立Fisher判别分析和K近邻算法2种分类模型，并对分类结果进行比较。结果表明，主成分分析提取特征变量后构建的分类模型，分类的准确率更高，对聚丙烯（PP）、PP/滑石粉、PP/滑石粉/碳酸钙（CaCO₃）3种类型的样本分类准确率达到92.3 %，对PP/滑石粉类型中的10种品牌样本分类准确率达到88.9 %，分类结果理想；在构建的2种分类模型中，Fisher判别分析模型的分类率远高于K近邻算法模型，分析认为K近邻算法模型受到样本不均衡的影响；中红外光谱结合化学计量学可以实现对车用保险杠碎片的准确区分，且满足快速、无损的检验要求。     

基于词法特征的恶意域名快速检测算法

针对互联网中恶意域名攻击事件频发，现有域名检测方法实时性不强的问题，提出一种基于词法特征的恶意域名快速检测算法。该算法根据恶意域名的特点，首先将所有待测域名按照长度进行正则化处理后赋予权值；然后利用聚类算法将待测域名划分成多个小组，并利用改进的堆排序算法按照组内权值总和计算各域名小组优先级，根据优先级降序依次计算各域名小组中每一域名与黑名单上域名之间的编辑距离；最后依据编辑距离值快速判定恶意域名。算法运行结果表明，基于词法特征的恶意域名快速检测算法与单一使用域名语义和单一使用域名词法的恶意域名检测算法相比，准确率分别提高1.7%与2.5%，检测速率分别提高13.9%与6.8%，具有更高的准确率和实时性。     

超级计算机网络引导技术研究与分析

针对超级计算机系统中网络引导时间开销大的问题，提出网络引导分布算法是影响网络引导性能的主要因素之一，是优化网络引导性能的主要方向的观点。首先，分析了影响大规模网络引导性能的主要因素；其次，结合一种典型超级计算机系统，分析了超节点循环分布算法（SCDA）和插件循环分布算法（BCDA）的网络引导数据流拓扑结构；最后，量化分析了这两种算法对各个网络路径段的压力和可获得的网络性能，发现BCDA性能是SCDA性能的1~20倍。通过理论分析和模型推导发现，在计算节点和引导服务器之间使用更细粒度的映射算法可以在引导部分资源时使用尽量多的引导服务器，减少对局部网络资源的过早竞争，提升网络引导性能。     

鲸鱼优化支持向量机的短期风电功率预测

为提高风电预测的精度,提出一种鲸鱼优化支持向量机SVM(support vector machine)的组合预测模型。该模型针对风电序列的非平稳波动特性,首先应用集合经验模态分解技术EEMD(ensemble empirical mode de?composition)将原始风电序列分解为一系列不同特征尺度的子序列;并引入鲸鱼优化算法WOA(whales optimiza?tion algorithm)解决SVM中学习参数选择难的问题,进而对各子序列建立WOA_SVM预测模型;最后,叠加各子序列的预测值以得到最终预测值。仿真表明,所提EEMD_WOA_SVM模型具有较高的风电预测精度,显著优于其他基本模型。     

气候环境实验室地面结冰云雾模拟控制系统设计

飞机结冰会引起飞机气动特性、动力系统性能改变,甚至造成飞行事故。地面结冰云雾模拟设施作为一种模拟飞机飞行结冰条件的重要设备,常用于飞机防除冰系统功能验证。针对气候环境实验室结冰云雾试验条件需要,在对地面结冰云雾模拟系统进行研究的基础上,对适用于气候环境实验室的结冰云雾模拟系统进行了设计。对系统关键设计技术、系统功能及组成进行了分析,并对控制系统方案进行了详细阐述。试验表明,控制系统人机界面友好,运行可靠,能够满足液态水含量、雾滴直径参数的精确调节,产生符合试验所需的结冰环境。     

Computation and investigation of mode characteristics in nonlinear system with tuned/mistuned contact interface

This study derived a novel computation algorithm for a mechanical system with multiple friction contact interfaces that is well-suited to the investigation of nonlinear mode characteristic of a coupling system. The procedure uses the incremental harmonic balance method to obtain the nonlinear parameters of the contact interface. Thereafter, the computed nonlinear parameters are applied to rebuild the matrices of the coupling system, which can be easily solved to calculate the nonlinear mode characteristics by standard iterative solvers. Lastly, the derived method is applied to a cycle symmetry system, which represents a shaft–disk–blade system subjected to dry friction. Moreover, this study analyzed the effects of the tuned and mistuned contact features on the nonlinear mode characteristics. Numerical results prove that the proposed method is particularly suitable for the study of nonlinear characteristics in such nonlinear systems.     

基于最近邻与神经网络融合模型的软测量建模方法

软测量建模能够有效地解决生产过程中在线分析仪表测量滞后大、价格昂贵、维护保养复杂等问题。目前，基于数据驱动的神经网络是软测量建模的主要工具之一。而在建模数据的采集过程中，主导变量的采集相对辅助变量要困难得多，由此产生了大量缺失标签的数据。但传统的软测量建模方法却忽视了这些无标签数据，只利用少量的有标签数据建模，从而影响了模型的预测精度。为了解决标签缺失的问题，采用最近邻算法对无标签数据进行伪标记，同时设计了由卷积操作与门限循环单元神经网络（GRU）结合的网络结构来进一步利用无标签数据，提取不同时刻数据中的动态特征，提高神经网络的预测精度。最后将该方法应用于丙烯精馏塔塔顶丙烷浓度的预测，实验结果表明该模型能有效处理非线性动态系统的标签缺失问题，具有更高的预测精度。     

Using hybridized ANN-GA prediction method for DOE performed drying experiments

Abstract

Coal is an important component in the energy industry and plays a key role in energy-producing facilities. Moisture is a common condition that has a considerable impact on coal. Coal drying has long been a question of great interest in a wide range of fields. Defining parameters in the coal drying is obtained by experiments. High costs, time constraints, and repetition of an experiment are one of the most frequently stated problems with experimental works. Using qualitative methods with experiments can be more useful for identifying and characterizing the coal drying process. The purpose of this article is finding the effective parameters in the coal drying process by using a hybridized prediction method. Genetic Algorithm (GA) and Artificial Neural Network (ANN) are hybridized with each other to identify and characterize the coal drying process. GA-ANN algorithm is applied to the coal drying process to predict the moisture of coal, but it does not provide a decent result at first. Later, the Design of Experiment (DoE) methodology is performed to determine the main effects of six parameters. Two scenarios are generated because two parameters are not statistically significant. The first scenario excludes the air relative humidity parameter, and the second scenario excludes the air relative humidity and the velocity of air parameters. Following the application of the DoE method, GA-ANN reaches decent results in scenario-2.     

Top-k-size keyword search on tree structured data

Keyword search is the most popular technique for querying large tree-structured datasets, often of unknown structure, in the web. Recent keyword search approaches return lowest common ancestors (LCAs) of the keyword matches ranked with respect to their relevance to the keyword query. A major challenge of a ranking approach is the efficiency of its algorithms as the number of keywords and the size and complexity of the data increase. To face this challenge most of the known approaches restrict their ranking to a subset of the LCAs (e.g., SLCAs, ELCAs), missing relevant results.In this work, we design novel top-k-size stack-based algorithms on tree-structured data. Our algorithms implement ranking semantics for keyword queries which is based on the concept of LCA size. Similar to metric selection in information retrieval, LCA size reflects the proximity of keyword matches in the data tree. This semantics does not rank a predefined subset of LCAs and through a layered presentation of results, it demonstrates improved effectiveness compared to previous relevant approaches. To address performance challenges our algorithms exploit a lattice of the partitions of the keyword set, which empowers a linear time performance. This result is obtained without the support of auxiliary precomputed data structures. An extensive experimental study on various and large datasets confirms the theoretical analysis. The results show that, in contrast to other approaches, our algorithms scale smoothly when the size of the dataset and the number of keywords increase.     

Self-adaptation of mobile systems driven by the Common Variability Language

The execution context in which pervasive systems or mobile computing run changes continually. Hence, applications for these systems require support for self-adaptation to the continual context changes. Most of the approaches for self-adaptive systems implement a reconfiguration service that receives as input the list of all possible configurations and the plans to switch between them. In this paper we present an alternative approach for the automatic generation of application configurations and the reconfiguration plans at runtime. With our approach, the generated configurations are optimal as regards different criteria, such as functionality or resource consumption (e.g. battery or memory). This is achieved by: (1) modelling architectural variability at design-time using the Common Variability Language (CVL), and (2) using a genetic algorithm that finds nearly-optimal configurations at run-time using the information provided by the variability model. We also specify a case study and we use it to evaluate our approach, showing that it is efficient and suitable for devices with scarce resources.